Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interval cyclic edge-colorings of graphs

A proper edge-coloring of a graph G with colors 1, , t  is called an interval cyclic t  coloring if all colors are used, and the edges incident to each vertex ( ) v V G  are colored with ( ) G d v consecutive colors by modulo t , where ( ) G d v is the degree of the vertex v in G . In this paper some properties of interval cyclic edge-colorings are investigated. Also, we give some bounds for...

متن کامل

On interval edge-colorings of outerplanar graphs

A proper edge-coloring of a graph G with colors 1, . . . , t is called an interval t-coloring if the colors of edges incident to any vertex of G form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. For an interval colorable graph G, the least value of t for which G has an interval t-coloring is denoted by w(G). A graph G is ...

متن کامل

Interval edge colorings of some products of graphs

An edge coloring of a graph G with colors 1, 2, . . . , t is called an interval t-coloring if for each i ∈ {1, 2, . . . , t} there is at least one edge of G colored by i, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable, if there is an integer t ≥ 1 for which G has an interval t-coloring. Let N be the set of all i...

متن کامل

Interval edge-colorings of composition of graphs

An edge-coloring of a graph G with consecutive integers c1, . . . , ct is called an interval t-coloring if all colors are used, and the colors of edges incident to any vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. The set of all interval colorable graphs is denoted by N. In 2004, Giaro and...

متن کامل

Interval edge-colorings of complete graphs

An edge-coloring of a graph G with colors 1, 2, . . . , t is an interval t-coloring if all colors are used, and the colors of edges incident to each vertex of G are distinct and form an interval of integers. A graph G is interval colorable if it has an interval t-coloring for some positive integer t. For an interval colorable graph G, W (G) denotes the greatest value of t for which G has an int...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2018

ISSN: 0012-365X

DOI: 10.1016/j.disc.2017.11.001